class BT_NODE{ KEY < $IS_LT{KEY}, ELT } < $BT_NODE{KEY,ELT,BT_NODE{KEY,ELT}}

---

Flattened version is here

---

Ancestors

$BT_NODE{_,_,_}

AREF{_}

Descendants

BT_NODE_DBG{_,_}

---

Public

Readable Attributes

attr size: INT;

****	Current fill ratio of the node.

Writable Attributes

attr size: INT;

****	Current fill ratio of the node.

Constants

const maxSize: INT := 4;

****	maximal number of elt tuples. MUST BE EVEN AND GREATER THAN 2.

const minSize: INT := maxSize / 2;

Features

create( t: TUP{KEY,ELT} ): SAME

create: SAME

find( k: KEY, stack: A_STACK{TUP{INT,SAME}} ): BOOL

findPred( stack: A_STACK{TUP{INT,SAME}} )

is_eq( n: SAME ): BOOL

joinLeft( pos: INT, stack: A_STACK{TUP{INT,SAME}} )

joinRight( pos: INT, stack: A_STACK{TUP{INT,SAME}} )

leftFree( stack: A_STACK{TUP{INT,SAME}} ): BOOL

leftSpare( stack: A_STACK{TUP{INT,SAME}} ): BOOL

nodeDelete( pos: INT )

nodeInsert( n: SAME, pos: INT )

pullLeft( pos: INT, stack: A_STACK{TUP{INT,SAME}} )

pullRight( pos: INT, stack: A_STACK{TUP{INT,SAME}} )

pushLeft( e: SAME, pos: INT, stack: A_STACK{TUP{INT,SAME}} )

pushRight( e: SAME, pos: INT, stack: A_STACK{TUP{INT,SAME}} )

rightFree( stack: A_STACK{TUP{INT,SAME}} ): BOOL

rightSpare( stack: A_STACK{TUP{INT,SAME}} ): BOOL

setItem( pos: INT, t: TUP{KEY,ELT} )

setNode( pos: INT, node: SAME )

split( e: SAME, pos: INT ): SAME

Iters

elt!: ELT

ind!: KEY

pair!: TUP{KEY,ELT}

---

The Sather Home Page

---